On computational complexity and honest polynomial degrees
نویسندگان
چکیده
منابع مشابه
Minimal Degrees for Honest Polynomial Reducibilities
The existence of minimal degrees is investigated for several polynomial reducibilities. It is shown that no set has minimal degree with respect to polynomial many-one or Turing reducibility. This extends a result. of Ladner [L] whew reciirsive sets are considered. An "honest '' polynomial reducibility, < ; , is defined which is a strengthening of polynomial Turing reduc-ibility. We prove that n...
متن کاملOn the structure of honest elementary degrees
We present some new results, and survey some old results, on the structure of honest elementary degrees. This paper should be a suitable first introduction to the honest elementary degrees.
متن کاملComputational Complexity in Polynomial Algebra
In recent years a number of algorithms have been designed for the "inverse" computational problems of polynomial algebra—factoring polynomials, solving systems of polynomial equations, or systems of polynomial inequalities, and related problems—with running time considerably less than that of the algorithms which were previously known. (For the computational complexity of the "direct" problems ...
متن کاملHonest Computability and Complexity
Computations manipulate representations of objects, most often strings of symbols taken from some finite alphabet, rather than the objects themselves. Numbers, for example, are usually denoted by sequences of decimal, or binary, or unary digits. In logic, one therefore distinguishes between numbers n, which reside in an ideal Platonic world, and numerals ⌜n⌝, their symbolic representation as (f...
متن کاملPolynomial division and its computational complexity
(i) First we show that all the known algorithms for polynomial division can be represented as algorithms for triangular Toeplitz matrix inversion. In spite of the apparent difference of the algorithms of these two classes, their strong equivalence is demonstrated. (ii) Then we accelerate parallel division of two polynomials with integer coefficients of degrees at most m by a factor of log m com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90354-5